Search combinators
نویسندگان
چکیده
منابع مشابه
Constraint-Based Combinators for Local Search
One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates that traditional combinators from constraint programming have natural counterparts for local search, although their underlying computational model is radically different. In particular, the paper shows that constraint combinator...
متن کاملCategorical Combinators
Our main aim is to present the connection between 2-calculus and Cartesian closed categories both in an untyped and purely syntactic setting. More specifically we establish a syntactic equivalence theorem between what we call categorical com-binatory logic and j-calculus with explicit products and projections, with fl and q-rules as well as with surjective pairing. "Combinatory logic" is of cou...
متن کاملInteraction Combinators
It is shown that a very simple system of interaction com-binators, with only 3 symbols and 6 rules, is a universal model of distributed computation, in a sense that will be made precise. This paper is the continuation of the au-thor's work on interaction nets, inspired by Girard's proof nets for linear logic, but no preliminary knowledge of these topics is required for its reading.
متن کاملEvolving Combinators
One of the many abilities that distinguish a mathematician from an automated deduction system is to be able to ooer appropriate expressions based on intuition and experience that are substituted for existentially quantiied variables so as to simplify the problem at hand substantially. We propose to simulate this ability with a technique called genetic programming for use in automated deduction....
متن کاملQuery Combinators
We introduce Rabbit, a combinator-based query language. Rabbit is designed to let data analysts and other accidental programmers query complex structured data. We combine the functional data model and the categorical semantics of computations to develop denotational semantics of database queries. In Rabbit, a query is modeled as a Kleisli arrow for a monadic container determined by the query ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2012
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-012-9137-8